KAWABE and ISHII : THE COMPLETENESS OF ORDER - SORTED TERM REWRITING SYSTEMS IS PRESERVED
نویسنده
چکیده
The currying of term rewriting systems (TRSs) is a transformation of TRSs from a functional form to an applicative form. We have already introduced an order-sorted version of currying and proved that the compatibility and con uence of order-sorted TRSs were preserved by currying[3]. In this paper, we focus on a key property of TRSs, completeness. We rst show some proofs omitted in ref.[3]. Then, we prove that the SN (strongly normalizing) property, which corresponds to termination of a program, is preserved by currying. Finally, we prove that the completeness of compatible order-sorted TRSs is preserved by currying. key words: Currying, Order-Sorted Term Rewriting Systems
منابع مشابه
On Modularity of the Completeness in Order-Sorted Term Rewriting Systems
In this paper, we extend the results on the modularity of con uence and termination of single-sorted TRSs[3][6][7] to order-sorted ones. Order-sorted TRSs build a good framework for handling overloaded functions and subtypes. For proving modularity of completeness of ordersorted TRSs, we rst transform a TRS with overloaded functions to a non-overloaded one, and then we demonstrate that our tran...
متن کاملCurrying of Order-Sorted Term Rewriting Systems
Term rewriting system is a helpful tool for implementing functional programming languages. We focus upon a transformation of term rewriting systems called currying. Currying transforms a term rewriting system with symbols of arbitrary arity into another one, which contains only nullary symbols with a single binary symbol called application. Currying in single-sorted case is explored in [1] but ...
متن کاملKAWABE and ISHII : TERMINATION OF ORDER - SORTED REWRITING WITH NON - MINIMAL
SUMMARY In this paper, we extend the Gnaedig's re-sults[2][3] on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformat...
متن کاملPersistence of Semi-Completeness for Term Rewriting Systems
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that weak normalization is persistent for term rewriting systems. Furthermore we obtain that semi-completeness is persistent for term rewriting systems and we give the exampl...
متن کاملPersistence of Termination for Term Rewriting Systems with Ordered Sorts
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting ...
متن کامل